Random Number Generators
نویسندگان
چکیده
Chris Dibble graduated Summa Cum Laude from Ball State University in 2013 with a degree in computer science and a minor in mathematics. He is currently employed as a Software Engineer at Interactive Intelligence in Indianapolis, Indiana. This paper is based on a project he completed in conjunction with Hannah Turner for an honors colloquium “Chaos Theory and Fractals” taught by Dr. Rich Stankewitz.
منابع مشابه
Design of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملFast and Reliable Random Number Generators for Scientific Computing
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...
متن کاملFast and Reliable Random Number Generators
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...
متن کاملA Unified View of Long-period Random Number Generators
Two types of linear congruent.ial random number generator are considered: the conventional one using integer arithmetic and another using polynomial arithmetic over finite fields. We show t.hat most of the long-period random number generators currently used or recently proposed, which include multiple re.:ursive generators, shift register generators, add-with-carry and subtract-with-borrow gene...
متن کاملOn Random Number Generation
Introduction Random numbers play a large and significant role in several fields and applications from cryptography to gaming to gambling. As a result, random number generators (RNGs) occupy a similarly important role. By their very nature, however, random numbers are difficult to fabricate, especially in the large quantities that they are often needed. In this paper I will discuss various topic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016